0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : run_E %s %d THM
0.12/0.32	% Computer : n027.cluster.edu
0.12/0.32	% Model    : x86_64 x86_64
0.12/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory   : 8042.1875MB
0.12/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1440
0.12/0.33	% WCLimit    : 180
0.12/0.33	% DateTime   : Thu Jul  4 08:47:54 EDT 2024
0.12/0.33	% CPUTime    : 
0.20/0.46	Running higher-order theorem proving
0.20/0.47	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.SOzD9xoRPP/E---3.1_30496.p
0.20/0.49	# Version: 3.2.0-ho
0.20/0.49	# Preprocessing class: HSMSSMSMSSSNSSA.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting ho_unfolding_3 with 900s (5) cores
0.20/0.49	# Starting ehoh_best_sine_rwall with 180s (1) cores
0.20/0.49	# Starting sh5l with 180s (1) cores
0.20/0.49	# Starting new_bool_3 with 180s (1) cores
0.20/0.49	# ehoh_best_sine_rwall with pid 30575 completed with status 0
0.20/0.49	# Result found by ehoh_best_sine_rwall
0.20/0.49	# Preprocessing class: HSMSSMSMSSSNSSA.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting ho_unfolding_3 with 900s (5) cores
0.20/0.49	# Starting ehoh_best_sine_rwall with 180s (1) cores
0.20/0.49	# SinE strategy is gf500_gu_R04_F100_L20000
0.20/0.49	# Search class: HGHSF-FFMM11-SSSFFFBN
0.20/0.49	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.20/0.49	# Starting ho_unfolding_3 with 109s (1) cores
0.20/0.49	# ho_unfolding_3 with pid 30579 completed with status 0
0.20/0.49	# Result found by ho_unfolding_3
0.20/0.49	# Preprocessing class: HSMSSMSMSSSNSSA.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting ho_unfolding_3 with 900s (5) cores
0.20/0.49	# Starting ehoh_best_sine_rwall with 180s (1) cores
0.20/0.49	# SinE strategy is gf500_gu_R04_F100_L20000
0.20/0.49	# Search class: HGHSF-FFMM11-SSSFFFBN
0.20/0.49	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.20/0.49	# Starting ho_unfolding_3 with 109s (1) cores
0.20/0.49	# Preprocessing time       : 0.002 s
0.20/0.49	# Presaturation interreduction done
0.20/0.49	
0.20/0.49	# Proof found!
0.20/0.49	# SZS status Theorem
0.20/0.49	# SZS output start CNFRefutation
0.20/0.49	thf(decl_30, type, lAnna_THFTYPE_i: $i).
0.20/0.49	thf(decl_33, type, lBill_THFTYPE_i: $i).
0.20/0.49	thf(decl_35, type, lBob_THFTYPE_i: $i).
0.20/0.49	thf(decl_36, type, lMary_THFTYPE_i: $i).
0.20/0.49	thf(decl_38, type, lSue_THFTYPE_i: $i).
0.20/0.49	thf(decl_39, type, likes_THFTYPE_IiioI: $i > $i > $o).
0.20/0.49	thf(decl_42, type, parent_THFTYPE_IiioI: $i > $i > $o).
0.20/0.49	thf(con, conjecture, ?[X15:$i > $i > $o, X16:$i > $i > $o, X17:$i]:(((~(((X16)=(X15)))&(X15 @ X17 @ lAnna_THFTYPE_i))&(X16 @ X17 @ lBill_THFTYPE_i))), file('/export/starexec/sandbox2/tmp/tmp.SOzD9xoRPP/E---3.1_30496.p', con)).
0.20/0.49	thf(ax_012, axiom, (parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i), file('/export/starexec/sandbox2/tmp/tmp.SOzD9xoRPP/E---3.1_30496.p', ax_012)).
0.20/0.49	thf(ax, axiom, (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i), file('/export/starexec/sandbox2/tmp/tmp.SOzD9xoRPP/E---3.1_30496.p', ax)).
0.20/0.49	thf(ax_025, axiom, ~((parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)), file('/export/starexec/sandbox2/tmp/tmp.SOzD9xoRPP/E---3.1_30496.p', ax_025)).
0.20/0.49	thf(ax_004, axiom, (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i), file('/export/starexec/sandbox2/tmp/tmp.SOzD9xoRPP/E---3.1_30496.p', ax_004)).
0.20/0.49	thf(ax_021, axiom, (likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i), file('/export/starexec/sandbox2/tmp/tmp.SOzD9xoRPP/E---3.1_30496.p', ax_021)).
0.20/0.49	thf(c_0_6, negated_conjecture, ~(?[X15:$i > $i > $o, X16:$i > $i > $o, X17:$i]:(((((X16)!=(X15))&(X15 @ X17 @ lAnna_THFTYPE_i))&(X16 @ X17 @ lBill_THFTYPE_i)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])])).
0.20/0.49	thf(c_0_7, negated_conjecture, ![X59:$i > $i > $o, X60:$i > $i > $o, X61:$i]:((((X60)=(X59))|~(X59 @ X61 @ lAnna_THFTYPE_i)|~(X60 @ X61 @ lBill_THFTYPE_i))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
0.20/0.49	thf(c_0_8, negated_conjecture, ![X16:$i > $i > $o, X15:$i > $i > $o, X1:$i]:((((X15)=(X16))|~((X16 @ X1 @ lAnna_THFTYPE_i))|~((X15 @ X1 @ lBill_THFTYPE_i)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.49	thf(c_0_9, plain, (parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i), inference(split_conjunct,[status(thm)],[ax_012])).
0.20/0.49	thf(c_0_10, negated_conjecture, ![X15:$i > $i > $o]:((((X15)=(parent_THFTYPE_IiioI))|~((X15 @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.20/0.49	thf(c_0_11, plain, (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i), inference(split_conjunct,[status(thm)],[ax])).
0.20/0.49	thf(c_0_12, negated_conjecture, ![X95:$i, X94:$i, X15:$i > $i > $o]:((((X15 @ X94 @ X95)<=>(parent_THFTYPE_IiioI @ X94 @ X95))|~((X15 @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))), inference(arg_cong,[status(thm)],[c_0_10])).
0.20/0.49	thf(c_0_13, negated_conjecture, ((likes_THFTYPE_IiioI)=(parent_THFTYPE_IiioI)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.20/0.49	thf(c_0_14, plain, ~(parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i), inference(fof_simplification,[status(thm)],[ax_025])).
0.20/0.49	thf(c_0_15, negated_conjecture, ![X1:$i, X15:$i > $i > $o, X2:$i]:(((X15 @ X1 @ X2)|~((X15 @ lSue_THFTYPE_i @ lBill_THFTYPE_i))|~((parent_THFTYPE_IiioI @ X1 @ X2)))), inference(dynamic_cnf,[status(thm)],[c_0_12])).
0.20/0.49	thf(c_0_16, negated_conjecture, ![X96:$i, X97:$i]:(((likes_THFTYPE_IiioI @ X96 @ X97)<=>(parent_THFTYPE_IiioI @ X96 @ X97))), inference(arg_cong,[status(thm)],[c_0_13])).
0.20/0.49	thf(c_0_17, plain, ~(parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i), inference(fof_nnf,[status(thm)],[c_0_14])).
0.20/0.49	thf(c_0_18, negated_conjecture, ![X2:$i, X1:$i]:((((lBill_THFTYPE_i)=(X1))|~((parent_THFTYPE_IiioI @ X2 @ X1)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_15])).
0.20/0.49	thf(c_0_19, plain, (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i), inference(split_conjunct,[status(thm)],[ax_004])).
0.20/0.49	thf(c_0_20, negated_conjecture, ![X1:$i, X2:$i]:(((parent_THFTYPE_IiioI @ X1 @ X2)|~((likes_THFTYPE_IiioI @ X1 @ X2)))), inference(dynamic_cnf,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_21, plain, (likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i), inference(split_conjunct,[status(thm)],[ax_021])).
0.20/0.49	thf(c_0_22, plain, ~((parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.49	thf(c_0_23, negated_conjecture, ((lAnna_THFTYPE_i)=(lBill_THFTYPE_i)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.20/0.49	thf(c_0_24, negated_conjecture, (parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.20/0.49	thf(c_0_25, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_23]), c_0_24])]), ['proof']).
0.20/0.49	# SZS output end CNFRefutation
0.20/0.49	# Parsed axioms                        : 71
0.20/0.49	# Removed by relevancy pruning/SinE    : 28
0.20/0.49	# Initial clauses                      : 48
0.20/0.49	# Removed in clause preprocessing      : 5
0.20/0.49	# Initial clauses in saturation        : 43
0.20/0.49	# Processed clauses                    : 114
0.20/0.49	# ...of these trivial                  : 7
0.20/0.49	# ...subsumed                          : 17
0.20/0.49	# ...remaining for further processing  : 90
0.20/0.49	# Other redundant clauses eliminated   : 0
0.20/0.49	# Clauses deleted for lack of memory   : 0
0.20/0.49	# Backward-subsumed                    : 0
0.20/0.49	# Backward-rewritten                   : 16
0.20/0.49	# Generated clauses                    : 69
0.20/0.49	# ...of the previous two non-redundant : 69
0.20/0.49	# ...aggressively subsumed             : 0
0.20/0.49	# Contextual simplify-reflections      : 0
0.20/0.49	# Paramodulations                      : 35
0.20/0.49	# Factorizations                       : 0
0.20/0.49	# NegExts                              : 0
0.20/0.49	# Equation resolutions                 : 0
0.20/0.49	# Disequality decompositions           : 0
0.20/0.49	# Total rewrite steps                  : 42
0.20/0.49	# ...of those cached                   : 28
0.20/0.49	# Propositional unsat checks           : 0
0.20/0.49	#    Propositional check models        : 0
0.20/0.49	#    Propositional check unsatisfiable : 0
0.20/0.49	#    Propositional clauses             : 0
0.20/0.49	#    Propositional clauses after purity: 0
0.20/0.49	#    Propositional unsat core size     : 0
0.20/0.49	#    Propositional preprocessing time  : 0.000
0.20/0.49	#    Propositional encoding time       : 0.000
0.20/0.49	#    Propositional solver time         : 0.000
0.20/0.49	#    Success case prop preproc time    : 0.000
0.20/0.49	#    Success case prop encoding time   : 0.000
0.20/0.49	#    Success case prop solver time     : 0.000
0.20/0.49	# Current number of processed clauses  : 38
0.20/0.49	#    Positive orientable unit clauses  : 21
0.20/0.49	#    Positive unorientable unit clauses: 0
0.20/0.49	#    Negative unit clauses             : 3
0.20/0.49	#    Non-unit-clauses                  : 14
0.20/0.49	# Current number of unprocessed clauses: 22
0.20/0.49	# ...number of literals in the above   : 55
0.20/0.49	# Current number of archived formulas  : 0
0.20/0.49	# Current number of archived clauses   : 52
0.20/0.49	# Clause-clause subsumption calls (NU) : 154
0.20/0.49	# Rec. Clause-clause subsumption calls : 118
0.20/0.49	# Non-unit clause-clause subsumptions  : 14
0.20/0.49	# Unit Clause-clause subsumption calls : 63
0.20/0.49	# Rewrite failures with RHS unbound    : 0
0.20/0.49	# BW rewrite match attempts            : 3
0.20/0.49	# BW rewrite match successes           : 2
0.20/0.49	# Condensation attempts                : 114
0.20/0.49	# Condensation successes               : 1
0.20/0.49	# Termbank termtop insertions          : 4105
0.20/0.49	# Search garbage collected termcells   : 479
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.010 s
0.20/0.49	# System time              : 0.002 s
0.20/0.49	# Total time               : 0.012 s
0.20/0.49	# Maximum resident set size: 1924 pages
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.011 s
0.20/0.49	# System time              : 0.005 s
0.20/0.49	# Total time               : 0.016 s
0.20/0.49	# Maximum resident set size: 1776 pages
0.20/0.49	% E---3.1 exiting
0.20/0.50	% E exiting
0.20/0.50	EOF